Normal Fans of Polyhedral Convex Sets Structures and Connections

نویسندگان

  • Shu Lu
  • Stephen M. Robinson
  • Boris Mordukhovich
چکیده

The normal fan of a polyhedral convex set in Rn is the collection of its normal cones. The structure of the normal fan reflects the geometry of that set. This paper reviews and studies properties about the normal fan. In particular, it investigates situations in which the normal fan of a polyhedral convex set refines, or is a subfan of, that of another set. It then applies these techniques in several examples. One of these concerns the face structure and normal manifold of the critical cone of a polyhedral convex set associated with a point in Rn. Another concerns how perturbation of the right hand side of the linear constraints defining such a set affects the normal fan and the face structure. The research reported here was sponsored in part by the National Science Foundation under Grant DMS0305930, in part by the Air Force Research Laboratory under agreement numbers FA9550-04-1-0192 and FA9550-07-1-0389, and in part by the U. S. Army Research Laboratory and the U. S. Army Research Office under Grant DAAD19-01-1-0502. The U. S. Government has certain rights in this material, and is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the sponsoring agencies or the U. S. Government. Shu Lu Department of Statistics and Operations Research 210 Smith Building, CB# 3260 The University of North Carolina at Chapel Hill Chapel Hill, NC 27599-3260, USA Tel: +1-919-962-1048 Fax: +1-919-962-0391 E-mail: [email protected] Stephen M. Robinson Department of Industrial and Systems Engineering University of Wisconsin-Madison 1513 University Ave Rm 3015 Madison, WI 53706-1539, USA Tel: +1-608-263-6862 Fax: +1-608-262-8454 E-mail: [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Greedy Fans: A geometric approach to dual greedy algorithms

The purpose of this paper is to understand greedily solvable linear programs in a geometric way. Such linear programs have recently been considered by Queyranne, Spieksma and Tardella, Faigle and Kern, and Krüger for antichains of posets, and by Frank for a class of lattice polyhedra, and by Kashiwabara and Okamoto for extreme points of abstract convex geometries. Our guiding principle is that ...

متن کامل

Convex structures via convex $L$-subgroups of an $L$-ordered group

In this paper, we first characterize the convex $L$-subgroup of an $L$-ordered group by means of fourkinds of cut sets of an $L$-subset. Then we consider the homomorphic preimages and the product of convex $L$-subgroups.After that, we introduce an $L$-convex structure constructed by convex $L$-subgroups.Furthermore, the notion of the degree to which an $L$-subset of an $L$-ord...

متن کامل

Minkowski sum of HV-polytopes in Rn

Minkowski sums cover a wide range of applications in many different fields like algebra, morphing, robotics, mechanical CAD/CAM systems ... This paper deals with sums of polytopes in a n dimensional space provided that both H-representation and V-representation are available i.e. the polytopes are described by both their half-spaces and vertices. The first method uses the polytope normal fans a...

متن کامل

Three Counter-Examples on Semi-Graphoids

Semi-graphoids are combinatorial structures that arise in statistical learning theory. They are equivalent to convex rank tests and to polyhedral fans that coarsen the reflection arrangement of the symmetric group Sn. In this paper we resolve two problems on semi-graphoids posed in Studený’s book [19], and we answer a related question of Postnikov, Reiner, and Williams on generalized permutohed...

متن کامل

A convex combinatorial property of compact sets in the plane and its roots in lattice theory

K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008